/** Copyright (c) 2008-2009, Markos Evlogimenos
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in
 *       the documentation and/or other materials provided with the
 *       distribution.
 *     * The name of Markos Evlogimenos may be used to endorse or
 *		 promote products derived from this software without specific
 *		 prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */

package org.kamimark.pools;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Iterator;

public class Pool<T extends PoolElement> implements Iterable<T>, Serializable
{

	private static final long serialVersionUID = 1L;

	protected ArrayList<T> objects;
	private int totalSize;
	private final int limit;

	public Pool(final int limit) {
		objects = new ArrayList<T>(limit);
		this.limit = limit;
		totalSize = 0;
	}

	public boolean add(final T elem) {
		if (limit < elem.size() + totalSize)
			return false;
		if (objects.contains(elem))
			return false;
		if (!objects.add(elem))
			return false;
		totalSize += elem.size();
		return true;
	}

	public void clear() {
		objects.clear();
		totalSize = 0;
	}

	public boolean contains(final Object elem) {
		return objects.contains(elem);
	}

	@Override
	public boolean equals(final Object o) {
		// TODO
		return objects.equals(o);
	}

	@Override
	public int hashCode() {
		// TODO
		return objects.hashCode();
	}

	public boolean isEmpty() {
		return objects.isEmpty();
	}

	public Iterator<T> iterator() {
		return objects.iterator();
	}

	public boolean remove(final T elem) {
		if (!objects.remove(elem))
			return false;
		totalSize -= elem.size();
		return true;
	}

	public int size() {
		return objects.size();
	}

	public Object[] toArray() {
		return objects.toArray();
	}

	@SuppressWarnings("hiding")
	public <T> T[] toArray(final T[] a) {
		return objects.toArray(a);
	}

	@Override
	public String toString() {
		return objects.toString();
	}
}
